Decompositions of the Boolean Lattice into Rank-symmetric Chains
نویسندگان
چکیده
منابع مشابه
Decompositions of the Boolean Lattice into Rank-symmetric Chains
The Boolean lattice 2[n] is the power set of [n] ordered by inclusion. A chain c0 ⊂ · · · ⊂ ck in 2[n] is rank-symmetric, if |ci|+ |ck−i| = n for i = 0, . . . , k; and it is symmetric, if |ci| = (n− k)/2 + i. We prove that there exist a bijection p : [n] → [n] and a partial ordering < on [n](>n/2) satisfying the following properties: • ⊂ is an extension of < on [n](>n/2); • if C ⊂ [n](>n/2) is ...
متن کاملLong Symmetric Chains in the Boolean Lattice
Let [n] = {1, 2, . . . , n} be a set with n elements, and let 2[n] denote the poset of all subsets of [n] ordered by inclusion. In other words, 2[n] is the Boolean lattice of order n or the n-dimensional hypercube. It is easy (for example using a symmetric chain decomposition [1, Theorem 3.1.1]) to find n disjoint skipless (saturated) symmetric chains of length n − 2, that is n disjoint chains ...
متن کاملVenn Diagrams and Symmetric Chain Decompositions in the Boolean Lattice
We show that symmetric Venn diagrams for n sets exist for every prime n, settling an open question. Until this time, n = 11 was the largest prime for which the existence of such diagrams had been proven, a result of Peter Hamburger. We show that the problem can be reduced to finding a symmetric chain decomposition, satisfying a certain cover property, in a subposet of the Boolean lattice Bn, an...
متن کاملPartitioning the Boolean Lattice into Chains of Large Minimum Size
Let 2[n] denote the Boolean lattice of order n, that is, the poset of subsets of {1, . . . , n} ordered by inclusion. Recall that 2[n] may be partitioned into what we call the canonical symmetric chain decomposition (due to de Bruijn, Tengbergen, and Kruyswijk), or CSCD. Motivated by a question of Füredi, we show that there exists a function d(n) ∼ 1 2 √ n such that for any n ≥ 0, 2[n] may be p...
متن کاملOn the existence of symmetric chain decompositions in a quotient of the Boolean lattice
We highlight a question about binary necklaces, i.e., equivalence classes of binary strings under rotation. Is there a way to choose representatives of the n-bit necklaces so that the subposet of the Boolean lattice induced by those representatives has a symmetric chain decomposition? Alternatively, is the quotient of the Boolean lattice Bn, under the action of the cyclic group Zn, a symmetric ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2016
ISSN: 1077-8926
DOI: 10.37236/5328